Geometric separation by single-pass alternating thresholding
نویسندگان
چکیده
منابع مشابه
Geometric Separation by Single-Pass Alternating Thresholding
Modern data is customarily of multimodal nature, and analysis tasks typically require separation into the single components. Although a highly ill-posed problem, the morphological difference of these components sometimes allow a very precise separation such as, for instance, in neurobiological imaging a separation into spines (pointlike structures) and dendrites (curvilinear structures). Recent...
متن کاملGlobal Thresholding and Multiple-Pass Parsing
We present a variation on classic beam thresholding techniques that is up to an order of magnitude faster than the traditional method, at the same performance level. We also present a new thresholding technique, global thresholding, which, combined with the new beam thresholding, gives an additional factor of two improvement, and a novel technique, multiple pass parsing, tha t can be combined w...
متن کاملGeometric source separation: merging convolutive source separation with geometric beamforming
Blind source separation of broad band signals in a multi-path environment remains a di cult problem. Robustness has been limited due to frequency permutation ambiguities. Increasing the number of sensors allows improved performance but introduces degrees of freedom in the separating lters that are not determined by separation criteria. We propose to further shape the lters and improve the robus...
متن کاملGeometric Separation in R
The geometric separation problem, initially posed by Donoho and Kutyniok [7], aims to separate a distribution containing a non-trivial superposition of point and curvilinear singularities into its distinct geometric constituents. The solution proposed in [7] considers expansions with respect to a combined wavelet-curvelet dictionary and applies an `-norm minimization over the expansion coeffici...
متن کاملGeometric Separation Problems
We propose to study combinatorial and algorithmic aspects of geometric separation problems in the plane. In such a situation one is given a set of points, line segments or polygons in the plane and a set of separators such as lines, line segments, disks or polygons and the goal is to select a small subset of those separators such that every path between any two objects is intersected by at leas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied and Computational Harmonic Analysis
سال: 2014
ISSN: 1063-5203
DOI: 10.1016/j.acha.2013.02.001